Enumerating Contingency Tables via Random Permanents
نویسنده
چکیده
N/N !. In many cases, lnT ′ provides an asymptotically accurate estimate of lnT . The idea of the algorithm is to express T as the expectation of the permanent of an N ×N random matrix with exponentially distributed entries and approximate the expectation by the integral T ′ of an efficiently computable log-concave function on R. Applications to counting integer flows in graphs are also discussed.
منابع مشابه
Characterizing Optimal Sampling of Binary Contingency Tables via the Configuration Model
A binary contingency table is an m×n array of binary entries with row sums r = (r1, . . . , rm) and column sums c = (c1, . . . , cn). The configuration model generates a contingency table by considering ri tokens of type 1 for each row i and cj tokens of type 2 for each column j, and then taking a uniformly random pairing between type-1 and type-2 tokens. We give a necessary and sufficient cond...
متن کاملEfficient circuits for quantum walks
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph’s method for preparing coherent versions of efficiently integrable probability distributions [2]. This method is intended for use in quantum walk algorithms with polynomial speedups, whose complexity is usually measu...
متن کاملCounting and enumerating frequency tables with given margins
The problem of finding the number of rectangular tables of non-negative integers with given row and column sums occurs in many interesting contexts, mainly in combinatorial problems (counting magic squares, enumerating permutation by descents, etc.) and in statistical applications (studying contingency tables with given margins, testing for independence, etc.). In the present paper a new recurs...
متن کاملrTableICC: An R Package for Random Generation of 2×2×K and R×C Contingency Tables
In this paper, we describe the R package rTableICC that provides an interface for random generation of 2×2×K and R×C contingency tables constructed over either intraclass-correlated or uncorrelated individuals. Intraclass correlations arise in studies where sampling units include more than one individual and these individuals are correlated. The package implements random generation of contingen...
متن کاملComputing p-values in conditional independence models for a contingency table
We present a Markov chain Monte Carlo (MCMC) method for generating Markov chains using Markov bases for conditional independence models for a fourway contingency table. We then describe a Markov basis characterized by Markov properties associated with a given conditional independence model and show how to use the Markov basis to generate random tables of a Markov chain. The estimates of exact p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2008